Respondent‐driven sampling and the homophily configuration graph
نویسندگان
چکیده
منابع مشابه
Graph homology and graph configuration spaces
If R is a commutative ring, M a compact R-oriented manifold and G a finite graph without loops or multiple edges, we consider the graph configuration space MG and a Bendersky–Gitler type spectral sequence converging to the homology H∗(M, R). We show that its E1 term is given by the graph cohomology complex CA(G) of the graded commutative algebra A = H∗(M, R) and its higher differentials are obt...
متن کاملHomophily of Neighborhood in Graph Relational Classi er
Quality of collective inference relational graph classi er depends on a degree of homophily in a classi ed graph. If we increase homophily in the graph, the classi er would assign class-membership to the instances with reduced error rate. We propose to substitute traditionally used graph neighborhood method (based on direct neighborhood of vertex) with local graph ranking algorithm (activation ...
متن کاملToward Optimal Configuration Space Sampling
Sampling-based motion planning discovers the implicit connectivity of a configuration space by selecting and connecting sets of configurations. The structure of every configuration space dictates a number of optimal sets of samples whose selection by a sampling-based planner results in a complete roadmap of the space. Though it is generally computationally impractical to develop complete knowle...
متن کاملnew graph products for configuration processing
for the analysis of structures, the first step consists of configuration processing followed by data generation. this step is the most time consuming part of the analysis for large-scale structures. in this paper new graph products called triangular and circular graph products are developed for the formation of the space structures. the graph products are extensively used in graph theory and co...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics in Medicine
سال: 2018
ISSN: 0277-6715,1097-0258
DOI: 10.1002/sim.7973